A new 'Direction' for source location privacy in wireless sensor networks'
نویسندگان
چکیده
Preserving source location privacy in wireless sensor networks can be critical for several practical applications. Existing solutions proposed specifically for sensor networks rely on a combination of dynamic routing and dummy traffic to hide real event messages. While some privacy protection guarantees can be given, these solutions also tend to be expensive due to fake transmissions and non-shortest path routing overheads. In this paper, we propose a novel idea, of using a combination of directional antennas, transmit power control and information compression to provide lightweight and energy-efficient source location privacy. We discuss the adversary model extensively and then carefully layout characteristics of a realistic adversary. We show how use of directional antennas makes eavesdropping more costly for a realistic adversary and establish relationships between probability of compromise of location privacy, characteristics of directional antennas and size of the adversary’s eavesdropping network. Finally, we show how a simple information compression measure can greatly reduce message latency and prolong battery life by conserving energy. Results of extensive simulations in NS2, with our realistic directional antenna add-on, show that compared to existing solutions, we can achieve comparable privacy protection, better message latency, delivery ratio and many orders of magnitude improvement in energy consumption.
منابع مشابه
Sink Location Service Based on Fano Plane in Wireless Sensor Networks
Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAll-Direction Random Routing for Source-Location Privacy Protecting against Parasitic Sensor Networks
Wireless sensor networks are deployed to monitor the surrounding physical environments and they also act as the physical environments of parasitic sensor networks, whose purpose is analyzing the contextual privacy and obtaining valuable information from the original wireless sensor networks. Recently, contextual privacy issues associated with wireless communication in open spaces have not been ...
متن کاملMultiple Target Tracking in Wireless Sensor Networks Based on Sensor Grouping and Hybrid Iterative-Heuristic Optimization
A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012